skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Füredi, Zoltán"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Designs, Codes and Cryptography)
    Free, publicly-accessible full text available December 1, 2025
  2. ; ; ; ; (, SIAM Journal on Discrete Mathematics)
    Full Text Available 
  3. ; (, European Journal of Combinatorics)
    Full Text Available 
  4. ; ; ; (, Journal of Combinatorial Theory, Series B)
    Full Text Available 
  5. ; ; ; ; (, Canadian Journal of Mathematics)
    Abstract An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich history with applications to a variety of problems in combinatorial geometry. In this paper, we consider analogous extremal problems for uniform hypergraphs, and determine the order of magnitude of the extremal function for various ordered and convex geometric paths and matchings. Our results generalize earlier works of Braß–Károlyi–Valtr, Capoyleas–Pach, and Aronov–Dujmovič–Morin–Ooms-da Silveira. We also provide a new variation of the Erdős-Ko-Rado theorem in the ordered setting. 
    more » « less
    Full Text Available 
  6. ; (, The Electronic Journal of Combinatorics)
    Gyárfas proved that every coloring of the edges of $$K_n$$ with $t+1$ colors contains a monochromatic connected component of size at least $n/t$. Later, Gyárfás and Sárközy asked for which values of $$\gamma=\gamma(t)$$ does the following strengthening for almost complete graphs hold: if $$G$$ is an $$n$$-vertex graph with minimum degree at least $$(1-\gamma)n$$, then every $(t+1)$-edge coloring of $$G$$ contains a monochromatic component of size at least $n/t$. We show $$\gamma= 1/(6t^3)$$ suffices, improving a result of DeBiasio, Krueger, and Sárközy. 
    more » « less
    Full Text Available 
  7. ; ; ; ; (, Journal of Combinatorial Theory, Series A)
    Full Text Available 
  8. ; ; (, The Electronic Journal of Combinatorics)
    We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases. 
    more » « less
    Full Text Available 
  9. ; ; ; (, Discrete & Computational Geometry)
    Full Text Available 
  10. ; ; ; ; (, Discrete Applied Mathematics)
    Full Text Available